Bounded game-theoretic semantics for modal mu-calculus

We introduce a new game-theoretic semantics (GTS) for the modal mu-calculus. Our so-called bounded GTS replaces parity games with alternative evaluation where only finite paths arise; infinite are not needed even when considered transition system is infinite. The novel offer approaches to various constructions in framework of While our main focus introducing GTS, we also consider some applications demonstrate its uses. For example, natural model transformation procedure that reduces checking single, fixed formula constructed models. use identify variants mu-calculus, including close logic PTime checking; iteration limited ordinals; and other systems semantic or syntactic specification mu-calculus has been modified way suggested by GTS.